Model-theoretic complexity of automatic structures
نویسندگان
چکیده
منابع مشابه
Model-theoretic complexity of automatic structures
We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We prove the following results: 1) The ordinal height of any automatic wellfounded partial order is bounded by ω; 2) The ordinal heights of automatic well-founded r...
متن کاملModel Theoretic Complexity of Automatic Structures (Extended Abstract)
We study the complexity of automatic structures via wellestablished concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and CantorBendixson ranks (of trees). We prove the following results: 1) The ordinal height of any automatic well-founded partial order is bounded by ω; 2) The ordinal heights of automatic well-founded re...
متن کاملThe model-theoretic complexity of automatic linear orders
Automatic structures are a subject which has gained a lot of attention in the “logic in computer science” community during the last fifteen years. Roughly speaking, a structure is automatic if its domain, relations and functions can be recognized by finite automata on strings or trees. In particular, such structures are finitely presentable. The investigation of automatic structures is largely ...
متن کاملComputability-theoretic complexity of countable structures
Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2009
ISSN: 0168-0072
DOI: 10.1016/j.apal.2009.07.012